Papers with multi-task scenarios

9 papers
MoRE: A Mixture of Low-Rank Experts for Adaptive Multi-Task Learning (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have revolutionized various domains, offering unprecedented performance across numerous tasks.
Approach: They propose a new Mixture of Low-Rank Experts (MoRE) for multi-task PEFT to improve performance of LLMs with fewer parameters.
Outcome: The proposed method improves performance over multiple tasks and no additional inference cost.
MoSLD: An Extremely Parameter-Efficient Mixture-of-Shared LoRAs for Multi-Task Learning (2025.coling-main)

Copied to clipboard

Challenge: LoRA is a key technique for fine-tuning large pre-trained models, yet its performance in multi-task learning scenarios often falls short.
Approach: They propose a mixture-of-shared-LoRAs model with a dropout strategy . they propose to share the upper projection matrix among different experts .
Outcome: The proposed model exhibits excellent performance in both single-task and multi-task scenarios with robust out-of-domain generalization capabilities.
PrAd: Prompt Adaptive Tuning for Decoder-only Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Prompt-based methods suffer from increased input lengths and sensitivity to weight initialization . adapter-based approaches can substantially increase inference time .
Approach: a new paradigm for prompt-based tuning addresses the problem of fine tuning pretrained models . prompt--based methods suffer from increased input lengths and sensitivity to weight initialization . a prompt-oriented approach employs adapters for flexible input transformation .
Outcome: a proposed framework can achieve comparable or better performance and higher inference efficiency even in multi-task scenarios.
WaveCoder: Widespread And Versatile Enhancement For Code Large Language Models By Instruction Tuning (2024.acl-long)

Copied to clipboard

Challenge: Recent work shows that Code Large Language Models can address a wide range of code-related tasks.
Approach: They propose a method to generate widespread and versatile instruction data from open source code datasets and use it to train code-related models.
Outcome: The proposed model outperforms open-source models in generalization ability across code-related tasks.
MALoRA: Mixture of Asymmetric Low-Rank Adaptation for Enhanced Multi-Task Learning (2025.findings-naacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) can be fine-tuned to new tasks, but in multi-task scenarios, training imbalance and seesaw effect often arise.
Approach: They propose a flexible fine-tuning framework that leverages asymmetric optimization among LoRA experts to reduce training imbalance and improve performance.
Outcome: The proposed framework outperforms baseline methods in inter- and intra-task learning scenarios.
Fisher Mask Nodes for Language Model Merging (2024.lrec-main)

Copied to clipboard

Challenge: Pre-trained models are ubiquitous in natural language processing, but individual fine-tuned models require significant overhead in multi-task scenarios.
Approach: They propose a method for fine-tuning pre-trained models for Transformers using Fisher information.
Outcome: The proposed method outperforms Fisher-weighted averaging in a fraction of the computational cost.
Multi-task Adversarial Attacks against Black-box Model with Few-shot Queries (2025.acl-long)

Copied to clipboard

Challenge: Existing adversarial text attacks rely on abundant access to shared internal features and numerous queries, limited to a single task type.
Approach: They propose a black-box attack that exploits the transferability of adversarial texts . they use a deep-level substitute model trained in a plug-and-play manner for text classification .
Outcome: The proposed attack can target multiple tasks with minimal perturbations . it can target commercial APIs, large language models, and image-generation models .
CoLA: Collaborative Low-Rank Adaptation (2025.findings-acl)

Copied to clipboard

Challenge: The scaling law of Large Language Models (LLMs) reveals diminishing return on performance as model scale increases.
Approach: They propose a more flexible LoRA architecture with an efficient initialization scheme . they propose combining three collaborative strategies to enhance performance .
Outcome: The proposed model outperforms existing methods in low-sample scenarios.
EIFBENCH: Extremely Complex Instruction Following Benchmark for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing benchmarks focusing on single-task environments with limited constraints lack the complexity required to fully reflect the evolution of large language models (LLMs).
Approach: They propose to use a Segment Policy Optimization algorithm to enhance the LLM's ability to accurately fulfill multi-task workflows.
Outcome: The proposed benchmarks show that existing benchmarks lack the complexity required to fully reflect the evolution of large language models.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations